Universal spaces for almost $n$-dimensionality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost universal graphs

We study the question as to when a random graph with n vertices and m edges contains a copy of almost all graphs with n vertices and cn/2 edges, c constant. We identify a ”phase transition” at c = 1. For c < 1, m needs to grow slightly faster than n, and we prove that m = O(n log log n/ log log log n) is sufficient. When c > 1, m needs to grow at a rate m = n1+a, where a = a(c) > 0 for every c ...

متن کامل

A Universal Investigation of $n$-representations of $n$-quivers

noindent We have two goals in this paper. First, we investigate and construct cofree coalgebras over $n$-representations of quivers, limits and colimits of $n$-representations of quivers, and limits and colimits of coalgebras in the monoidal categories of $n$-representations of quivers. Second, for any given quivers $mathit{Q}_1$,$mathit{Q}_2$,..., $mathit{Q}_n$, we construct a new quiver $math...

متن کامل

ALMOST S^{*}-COMPACTNESS IN L-TOPOLOGICAL SPACES

In this paper, the notion of almost S^{*}-compactness in L-topologicalspaces is introduced following Shi’s definition of S^{*}-compactness. The propertiesof this notion are studied and the relationship between it and otherdefinitions of almost compactness are discussed. Several characterizations ofalmost S^{*}-compactness are also presented.

متن کامل

Almost universal codes for MIMO wiretap channels

Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information theoretically secure codes over such channels remains as an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. We extend the flatness factor criterion...

متن کامل

Effective zero-dimensionality for computable metric spaces

We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zerodimensionality are shown to be equivalent. The part of this characterisation that concerns covering dimension extends to higher dimensions and to closed shrinkings of finite open covers. To deal with zero-dimensional subspaces uniformly, fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2007

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-07-08971-x